Integer Programming by Implicit Enumeration and Balas' Method
نویسنده
چکیده
منابع مشابه
A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملColumn generation in the integral simplex method
The integral simplex method for set partitioning problems allows only pivots-on-one to be made, which results in a primal all-integer method. In this technical note we outline how to tailor the column generation principle to this method. Because of the restriction to pivots-onone, only local optimality can be guaranteed, and to ensure global optimality we consider the use of implicit enumeratio...
متن کاملJournal of Uncertain Systems, 2011 Vol.5 No.4
The failure possibility of transmission lines in power system may change from time to time since it will be affected by weather, environment and operating conditions, especially under short-time period. Impacts of various conditions on failure possibility can be described using fuzzy words. In this paper, credibility theory was introduced to model the short-term line maintenance-scheduling prob...
متن کاملBalas E. An additive algorithm for solving linear programs with zero-one variables. Oper. Res. 13:517-46, 1965
The additive algorithm was one of the early versions of the approach known as implicit enumeration or branch and bound. It solves a linear program in n 0-1 variables by systematically enumerating an (often small) subset of the 2” possible binary n-vectors, while using the logical implications of the 0-1 property to ensure that the whole set is implicitly examined. [The Science Citation Index® (...
متن کاملAn Improved Implicit Enumeration Approach for Integer Programming
This paper synthesizes the Balasian implicit enumeration approach to integer linear programming with the approach typified by LAND AND DOIG and by ROY, BEBTIER, AND NGHIEM. The synthesis results from the use of an imbedded linear program to compute surrogate constraints that are as 'strong' as possible in a sense slightly different from that originally used by GLOVBK. A simple implicit enumerat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015